Tomography of Non-convex Polygons from a Single Point X-ray

نویسندگان

  • Mike Lauzon
  • Harvey Mudd
  • Ben Schmidt
چکیده

When the x-ray of an object is taken, an x-ray of known intensity is emitted from an x-ray source and then the intensity is measured at a sensor. The decrease in intensity is related to how much \stu " is between the source and the sensor. Mathematically, \how much stu " is along a line is the line integral of a function describing where \stu " is along that line. Tomography is the study of what one can tell about a function just by knowing the line integrals of that function. Fan beam tomography is tomography where integrals along the rays emanating from a point are known. Lam and Solmon [3] have reconstructed convex polygons away from the source of the x-ray. We seek to expand this technique to nonconvex polygons.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Empirical correlation for porosity deduction from X-ray computed tomography (CT)

For obtaining reservoir petrophysical properties, for example porosity, non-destructive methods such as X-ray computed tomography, CT, seems to be precise and accurate. Porosity is deducted from the CT image with a single scan via different techniques, such as pore space detection by image segmentation techniques then correlation with porosity. More than one hundred samples with carbonate li...

متن کامل

Single-Point Visibility Constraint Minimum Link Paths in Simple Polygons

We address the following problem: Given a simple polygon $P$ with $n$ vertices and two points $s$ and $t$ inside it, find a minimum link path between them such that a given target point $q$ is visible from at least one point on the path. The method is based on partitioning a portion of $P$ into a number of faces of equal link distance from a source point. This partitioning is essentially a shor...

متن کامل

Theory and Applications of Convex and Non-convex Feasibility Problems

Let X be a Hilbert space and let Cn, n = 1, . . . ,N be convex closed subsets of X . The convex feasibility problem is to find some point x ∈ N ⋂ n=1 Cn, when this intersection is non-empty. In this talk we discuss projection algorithms for finding such a feasibility point. These algorithms have wide ranging applications including: solutions to convex inequalities, minimization of convex nonsmo...

متن کامل

Patient doses from X-ray computed tomography examinations by a single-array detector unit: Axial versus spiral mode

Background: X-ray computed tomography (CT) examinations deliver a significant amount of radiation doses to patients comparing to conventional radiography examinations. The objective of the current study was to analyze and investigate the average patient received dose from axial and spiral CT exams in a medical imaging center. Material and Methods: In this study, the patient imaging tec...

متن کامل

Affinely Regular Polygons as Extremals of Area Functionals

For any convex n-gon P we consider the polygons obtained dropping a vertex or an edge of P . The area distance of P to such (n − 1)-gons, divided by the area of P , is an affinely invariant functional on n-gons whose maximizers coincide with the affinely regular polygons. We provide a complete proof of this result. We extend these area functionals to planar convex bodies and we present connecti...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1999